This paper presents the mathematical model and the general algorithms of transforming combinatorial problem into state space search 本文提出了將組合問題歸結(jié)為狀態(tài)空間搜索問題的數(shù)學(xué)模型和通用算法。
Firstly the idea of the general searching algorithms is to define one accurate compute model . then the state space searching algorithms a based on the compute model are submitted 通用搜索算法的思想是首先為狀態(tài)空間定義一個精確的計(jì)算模型,然后提出建立在該計(jì)算模型上的狀態(tài)空間搜索算法a 。
Most artificial intelligent planning algorithms are based on planning graph or state space search . ff based on both planning graph and heuristic state space search and performed standout in the 2nd and 3rd international planning competition Ff規(guī)劃器將規(guī)劃圖和啟發(fā)式狀態(tài)空間搜索原理進(jìn)行了很好的結(jié)合,在兩屆ipc ( internationalplanningcompetition )中取得了優(yōu)異的成績。
So this article put forward a theory that the optimal problems can be summed up to the mathematic and computing models of state space search of optimal problems . this conclusion unifies the dijstra algorithm used in finding shortest path of traditional explicit graphs and the optimal search of implicit graphs , the search of graph and the search of graphs " tree into a common model and algorithm 本文提出了將優(yōu)化問題歸結(jié)為狀態(tài)空間最優(yōu)化搜索問題的數(shù)學(xué)模型和通用算法,將傳統(tǒng)的在顯式圖中求最短路的dijstra算法與隱式圖的優(yōu)化搜索,隱式圖搜索與隱式樹搜索全部統(tǒng)一到同一個模型和算法中去。
State space search is a process used in the field of computer science, including artificial intelligence (AI), in which successive configurations or states of an instance are considered, with the goal of finding a goal state with a desired property.